A Separation Result for Secure Communication

نویسندگان

  • Vinod Prabhakaran
  • Kannan Ramchandran
چکیده

Alice wants to communicate securely to Bob in the presence of an eavesdropper Eve. There are two resources available to facilitate this. First, Alice, Bob (and Eve) have access to dependent source observations. Secondly, there is a noisy broadcast channel from Alice to Bob and Eve. Under this general source and channel setup, we are interested in three classes of problems. First, what is the secret key generation capacity, where Alice and Bob agree on a secret key to the exclusion of Eve? Secondly, what is the secure communication capacity where Alice wants to convey an independent secret message to Bob? Thirdly, what is the optimal joint secure communication capacity and attainable state distortion, where Alice wants to convey to Bob both her state (source) observation unsecurely, under a distortion constraint, and an independent secure message? While a complete characterization of these problems under general source and channel models remains open, we can fully characterize several interesting special cases. In a nutshell, these special cases involve those where either the sources or the channel are individually incapable of generating useful secret common randomness between Alice and Bob in the presence of Eve; i.e., one of the resources by itself is useless in generating a secret key. Interestingly, the solutions for these cases expose the optimality of a separation architecture at multiple scales. First, there is an optimal decoupling between the use of the correlated sources from the use of the noisy channel. Thus, when the latter is the useless resource, this separation implies that it can be abstracted away as a noiseless public bit-pipe of capacity equal to the capacity of the channel from Alice to Bob. Secondly, in this situation, for the secure communication problem, there is a separation in the use of this finite rate public bit-pipe between a key generation first-phase and a secure message transmission second-phase that uses the first-phase key as a one-time pad.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Secure Communication in Shotgun Cellular Systems

In this paper, we analyze the secure connectivity in Shotgun cellular systems (SCS: Wireless communication systems with randomly placed base stations) by Poisson intrinsically secure communication graph (IS-graph), i.e., a random graph which describes the connections that are secure over a network. For a base-station in SCS, a degree of secure connections is determined over two channel models: ...

متن کامل

Exponential Separation of Quantum and Classical One-Way Communication Complexity for a Boolean Function

We give an exponential separation between one-way quantum and classical communication complexity for a Boolean function. Earlier such a separation was known only for a relation. A very similar result was obtained earlier but independently by Kerenidis and Raz [KR06]. Our version of the result gives an example in the bounded storage model of cryptography, where the key is secure if the adversary...

متن کامل

GSLHA: Group-based Secure Lightweight Handover Authentication Protocol for M2M Communication

Machine to machine (M2M) communication, which is also known as machine type communication (MTC), is one of the most fascinating parts of mobile communication technology and also an important practical application of the Internet of Things. The main objective of this type of communication, is handling massive heterogeneous devices with low network overheads and high security guarantees. Hence, v...

متن کامل

A Secure Chaos-Based Communication Scheme in Multipath Fading Channels Using Particle Filtering

In recent years chaotic secure communication and chaos synchronization have received ever increasing attention. Unfortunately, despite the advantages of chaotic systems, Such as, noise-like correlation, easy hardware implementation, multitude of chaotic modes, flexible control of their dynamics, chaotic self-synchronization phenomena and potential communication confidence due to the very dynami...

متن کامل

An Incentive-Aware Lightweight Secure Data Sharing Scheme for D2D Communication in 5G Cellular Networks

Due to the explosion of smart devices, data traffic over cellular networks has seen an exponential rise in recent years. This increase in mobile data traffic has caused an immediate need for offloading traffic from operators. Device-to-Device(D2D) communication is a promising solution to boost the capacity of cellular networks and alleviate the heavy burden on backhaul links. However, dir...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007